Mapped out: Guyana’s indigenous mapmakers
نویسندگان
چکیده
منابع مشابه
“We’re checking them out”: Indigenous and non-Indigenous research participants’ accounts of deciding to be involved in research
BACKGROUND It is important for researchers to understand the motivations and decision-making processes of participants who take part in their research. This enables robust informed consent and promotes research that meets the needs and expectations of the community. It is particularly vital when working with Indigenous communities, where there is a history of exploitative research practices. In...
متن کاملAdmixture analysis of stocked brown trout populations using mapped microsatellite DNA markers: indigenous trout persist in introgressed populations.
Admixture between wild and captive populations is an increasing concern in conservation biology. Understanding the extent of admixture and the processes involved requires identification of admixed and non-admixed individuals. This can be achieved by statistical methods employing Bayesian clustering, but resolution is low if genetic differentiation is weak. Here, we analyse stocked brown trout p...
متن کاملMemory - Mapped Transactions
Memory-mapped transactions combine the advantages of both memory mapping and transactions to provide a programming interface for concurrently accessing data on disk without explicit I/O or locking operations. This interface enables a programmer to design a complex serial program that accesses only main memory, and with little to no modification, convert the program into correct code with multip...
متن کاملMapped Separation Logic
We present Mapped Separation Logic, an instance of Separation Logic for reasoning about virtual memory. Our logic is formalised in the Isabelle/HOL theorem prover and it allows reasoning on properties about page tables, direct physical memory access, virtual memory access, and shared memory. Mapped Separation Logic fully supports all rules of abstract Separation Logic, including the frame rule....
متن کاملMapped Shuffled Fibonacci Languages
The purpose of this paper is to study properties of mapped shuffled Fibonacci languages F(afi) and F^vy Let X — {a?6} be an alphabet and let X* be the free monoid generated by X. Let 1 be the empty word and let X+ — X* \ {1}. The length of a word u is denoted by lg(w). Every subset of X* is called a language. For two words u, v E X + ? we consider the following type of Fibonacci sequence of words:
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Index on Censorship
سال: 2014
ISSN: 0306-4220,1746-6067
DOI: 10.1177/0306422014536104